de_util ~master (2021-10-26T20:15:40.7960244)

breadth_first_search

devisualization util algorithms pathfinding breadthfirst

Locates the next node in graph to get to a position

  1. T[T] breadth_first_search(Graph graph, T start)
  2. T[T] breadth_first_search(Graph graph, T start, T goal)
  3. void breadth_first_search(Graph graph, T start, T goal, T[T] came_from, U[T] distance)
    deprecated
    void
    breadth_first_search
    (
    T
    U
    )
    (
    Graph graph
    ,
    T start
    ,
    T goal
    ,
    out T[T] came_from
    ,
    out U[T] distance
    )

Parameters

graph Graph

The graph of nodes

start T

Starting position to go to

goal T

The end position

came_from T[T]

Output: An AA mapping a position to another to get to a point

distance U[T]

Output: Distance of a node to the end point

See Also

http://www.redblobgames.com/pathfinding/tower-defense/

Meta

Source

See Implementation

devisualization util algorithms pathfinding breadthfirst functions

Page generated by adrdox